The dilemmas of a reconciler: Serving the East-West conflict

https://stars.library.ucf.edu/prism/1235/thumbnail.jp

Product recognition in store shelves as a sub-graph isomorphism problem

The arrangement of products in store shelves is carefully planned to maximize sales and keep customers happy. However, verifying compliance of real shelves to the ideal layout is a costly task routinely performed by the store personnel. In this paper, we propose a computer vision pipeline to recognize products on shelves and verify compliance to the planned layout. We deploy local invariant features together with a novel formulation of the product recognition problem as a sub-graph isomorphism between the items appearing in the given image and the ideal layout. This allows for auto-localizing the given image within the aisle or store and improving recognition dramatically.Comment: Slightly extended version of the paper accepted at ICIAP 2017. More information @project_page --> http://vision.disi.unibo.it/index.php?option=com_content&view=article&id=111&catid=7

Pattern matching and pattern discovery algorithms for protein topologies

We describe algorithms for pattern matching and pattern learning in TOPS diagrams (formal descriptions of protein topologies). These problems can be reduced to checking for subgraph isomorphism and finding maximal common subgraphs in a restricted class of ordered graphs. We have developed a subgraph isomorphism algorithm for ordered graphs, which performs well on the given set of data. The maximal common subgraph problem then is solved by repeated subgraph extension and checking for isomorphisms. Despite the apparent inefficiency such approach gives an algorithm with time complexity proportional to the number of graphs in the input set and is still practical on the given set of data. As a result we obtain fast methods which can be used for building a database of protein topological motifs, and for the comparison of a given protein of known secondary structure against a motif database

The D-Grid Integration Project: How to Build a Grid for Different Communities

The Grid world is highly dynamic due to the appearance of new resources, easier access and new Grid applications. Moreover, an increasing number of scientific communities begins to realize that Grids will become an indispensable tool for modern science. However, the requirements of those communities often differ significantly from each other. Therefore, it is a particularly di±cult challenge to establish a national Grid infrastructure that serves as many communities as possible. To address this challenge, the German D-Grid has developed a concept that is based on development of independent Community Grids that are connected with a single integration project. Further, the process will involve several steps to consider dependencies between the various projects and their tasks. Presently, we are still at the beginning of the realization of a German Grid. Therefore in this paper, we first briefly explain this concept in this paper. Then we focus on the integration project and describe its tasks in more detail. This includes some first results and experiences that were achieved within the first year of the project. Finally, some plans for future steps are presented

Features of pulsed synchronization of a systems with a tree-dimensional phase space

Features of synchronization picture in the system with the limit cycle embedded in a three-dimensional phase space are considered. By the example of Ressler system and Dmitriev - Kislov generator under the action of a periodic sequence of delta - function it is shown, that synchronization picture significantly depends on the direction of pulse action. Features of synchronization tons appeared in these models are observed.Comment: 16 pages, 11 figure